Conditions for a Bigraph to be Super-Cyclic

نویسندگان

چکیده

A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geqslant 3$, contains a Berge cycle base vertex set $A$. We present two natural necessary conditions to be super-pancyclic, and show that in several classes of hypergraphs these are also sufficient. In particular, they sufficient every $ \delta(\mathcal H)\geqslant \max\{|V(\mathcal H)|, \frac{|E(\mathcal H)|+10}{4}\}$.
 consider super-cyclic bipartite graphs: those $(X,Y)$-bigraphs $G$ such X$ has $C_A$ $V(C_A)\cap X=A$. Such graphs incidence hypergraphs, our proofs use the language graphs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diameter-sufficient conditions for a graph to be super-restricted connected

A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G − X must have at least two vertices. The restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinality of a restricted cut. Additionally, if the deletion of a minimum restricted cut isolates on...

متن کامل

Sufficient conditions for a graph to be super restricted edge-connected

Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut F of a connected graph G is an edge cut such that G−F has no isolated vertex. The restricted edge connectivity λ′ is theminimumcardinality over all restricted edge cuts.WecallG λ′-optimal if λ′ = ξ , where ξ is theminimum edgedegree inG. Moreover, a λ′-optimal graphG is called ...

متن کامل

a new approach to credibility premium for zero-inflated poisson models for panel data

هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...

15 صفحه اول

Sufficient conditions for bipartite graphs to be super-k-restricted edge connected

For a connected graph G = (V , E), an edge set S ⊂ E is a k-restricted edge cut if G − S is disconnected and every component of G − S contains at least k vertices. The k-restricted edge connectivity of G, denoted by λk(G), is defined as the cardinality of a minimum krestricted edge cut. For U1,U2 ⊂ V (G), denote the set of edges of Gwith one end in U1 and the other in U2 by [U1,U2]. Define ξk(G...

متن کامل

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2021

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9683